node of tree
英 [nəʊd ɒv triː]
美 [noʊd əv triː]
【计】树节点
双语例句
- Following the processing model of the language, it first locates the template rule for processing the root node of the input tree.
按照语言的处理模型，它首先查找处理输入树根节点的模板规则。 - The books node at the top of the tree has two child book tags.
树顶部的books节点有两个book子标记。 - To update a node of the tree you need to update the data existing in the data store.
要更新树的节点，您需要更新位于数据存储的数据。 - The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.
为了公平，调度器然后选取红黑树最左端的节点调度为下一个以便保持公平性。 - If a SOAP domain tree is sent to a non-SOAP output node, an XML serialization of the tree is currently written, rather than a SOAP-style Web service message.
如果将SOAP域树发送到非SOAP输出节点，当前会写出该树的XML序列化，而不是SOA样式的Web服务消息。 - It's also helpful if each node of the tree has a type visible to Clojure, which can be used when choosing a function implementation at runtime.
树的每个节点最好具有一个对于Clojure可见的类型，以便在运行时选择函数实现时使用。 - This was done because the right-click context menu is bound to the entire tree as a whole, as opposed to one for each node of the tree.
之所以这么做是因为右键单击上下文菜单绑定到整个树，而不是一个树节点。 - If you wanted to move the node to another part of the tree, you could call addNode() with the same variable to add it back into the document in a new location.
如果您需要将节点移动到树中的其他部分，那么可以使用相同的变量来调用addNode（）以将其重新添加到文档中新的位置。 - The starting point is a root node ( the root node is the base of the tree; all other nodes are descendents of this node).
起始点是一个rootnode（根节点是树的根基，所有其他节点都是这个节点的后代）。 - Your first step is to make a node of the organization tree.
第一步是构建组织树的一个节点。 - On the other hand, every time a user clicks one node of the tree, we will have a datagrid control to list all the services under this node.
另一方面，每次用户点击树的一个节点，我们都用数据网格控制来罗列节点下的所有服务。 - Navigate through each node of an in-memory data tree.
导航内存中的数据树中的每个节点。 - The render tree has at least one node for every node of the DOM tree that needs to be displayed ( hidden DOM elements don't have a corresponding node in the render tree).
渲染树中为每个需要显示的DOM树节点存放至少一个节点（隐藏DOM元素在渲染树中没有对应节点）。 - Node Splitting Algorithm of R~-tree Based on Four-dimensional Clustering
基于四维聚类的R~-树结点分裂算法 - Each child is a node or branch of the tree.
每个子级是树的一个节点或分支。 - XML document is transferred to sig-DOM tree, which includes signature and filter information. The query signature is compared with node signature of sig-DOM tree in query processing.
该算法将XML文档存储为含有签名和过滤剪枝信息的sig-DOM树，通过查询签名和结点签名的比较，实现基于签名的查询。 - It's easy to translate the node of regression tree into radial basis function. After the nodes of regression tree are visited, we can generate a set of radial basis functions from which the final network can be selected.
回归树的结点可以很容易地转换为径向基函数，通过对回归树结点的访问，可以选择出使网络达到最优的基函数集，形成最终的网络。 - The method uses a tree to represent a web page according to HTML tags, and then chooses the node which contains text content by using the number of the Chinese characters in each node of the tree.
该方法先根据网页中的HTML标记把网页表示成一棵树，然后利用树中每个结点包含的中文字符数从中选择包含正文信息的结点。 - Using the pointer jumping, the problem of the list ranking is solved. So the order of the node of the postorder-traversal binary tree is obtained.
将后序遍历二叉树的边构造一个单链表，使用指针跳越技术对单链表进行表序问题求解，从而得到后序遍历二叉树结点的顺序。 - The process of reiterative extraction of original vector reflected a tree type relationship, and the result of each step formed a node of the tree type catalog.
原型向量反复提取过程反映了一种树型关系，而每个阶段的结果形成树型目录的一个节点。 - A report is viewed as a relation model. It become a node of a tree structure, so that it can be compounded by other nodes via relation operation and also can generate a new node via inherit.
将报表本身看作一个关系模型，作为树结构上的一个节点，可以由其它节点经过关系运算复合而成，也可以通过继承机制生成新的节点。 - A geo-based search tree with branching factor K is constructed by recursively using cluster method to split scenes. The atomic region is defined on the leaf node of the search tree.
通过聚类算法递归的建立了一棵K叉树，将场景划分为由树的叶节点定义的若干原子区域。 - The path from the head node to a leafage node of the testing tree denotes a state transition path. Each path means a testing case.
从测试树的首节点到一个叶子节点表示一条状态转换路径，每一条路径代表了一个测试用例。 - But to build a decision tree, one has to search all possible combination of features and all possible separative hyperplane for the best split at each node of the tree. In this paper, we use the square criterion to achieve the best separation.
要构造一棵多变量决策树，在每个结点处必须搜索所有可能的属性组合方式以及所有可能的分割超平面来获得最优划分，本文利用平方标准来获得最优划分。 - For each leaf node of each decision tree, the shift information of the local features to the object center ( offest) and the class information of these features, together with the class information of this leaf node are stored.
在决策树的每个叶子节点中，记录到达该节点的局部特征相对于目标中心的偏移量及其相应的类别信息、以及该叶子节点的类别信息。 - In the spatial subdivision process, we proposes a primitives distributing strategy based on the node of the spatial subdivision hierarchy tree, which can reduce the times of tree traversal and the number of primitives have to be distributed, and improve the speed of collision detection.
在空间分解过程，我们提出一种基于节点的对象基本几何元素分配策略，减少树的遍历次数和待检测的基本几何元素的数量，提高了算法效率。 - Decision Tree algorithm is to focus on defining a measure to each node of the tree.
决策树算法的关键是给树的每个节点定义一个衡量标准。 - The paper use depth-first search algorithm to recursively traverse every node of the DOM Tree to determine whether the node contains the information that we are interested in.
然后设计了一种深度优先的搜索算法去递归地遍历生成的DOM树的每一结点，判断该节点是否包含我们感兴趣的信息。 - Simulation shows that the single node or link failure of multicast forward tree can be recovered effectively, and the two schemes have their advantage and disadvantage.
通过仿真分析发现，这两种方案都可以有效的恢复组播通信中单节点或链路的故障问题，且两种方案各有其优缺点。